Towards a logical semantics for pure Prolog
نویسندگان
چکیده
منابع مشابه
Towards a Logical Semantics for Pure Prolog
The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-rst left-to-right evaluation strategy of Prolog interpreters. We propose a semantics for Prolog programs based on a four-valued logic. The semantics is based on a new concept of completion analogous to Clark's and it enjoys the nice properties of the declarativ...
متن کاملProgramming Towards a Roberto Barbuti ” , logical semantics for pure Prolog ’
The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-first left-to-right evaluation strategy of Prolog interpreters. We propose a semantics for Prolog programs based on a four-valued logic. The semantics is based on a new concept of completion analogous to Clark’s and it enjoys the nice properties of the declarat...
متن کاملA Multiple-Valued Logical Semantics for Prolog
Abs t rac t . The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-first left-to-right evaluation strategy of Prolog interpreters. We propose a new semantics for Prolog programs based on a new fourvalued logic. The semantics is based on a new concept of completion analogous to Clark's and it enjoys the nice prope...
متن کاملA Logical Semantics for Depth-First Prolog with Ground Negation
A sound and complete semantics is given for sequential, depth-rst logic programming with a version of negation as failure. The semantics is logical in the sense that it is built up only from valuation functions (multi-valued logic interpretations in the style of Fitting and Kunen) and logically-motivated equivalence relations between formulas. The notion of predicate folding and unfolding with ...
متن کاملA Denotational Semantics for Prolog
analysis is nite, which was not the case in our previous proposal [13]. The overheadneeded for reaching an improved precision essentially consists in the use of observability andkernel constraints and of their success and failure conditions.We can now consider the already mentioned paper [11]. A big di erence arises lookingfor instance at the way they handle clause composition a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1998
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(97)00033-6